Randomized Algorithms for Minimum Distance Localization

Randomized Algorithms for Minimum Distance Localization

The problem of minimum distance localization in environments that may contain self-similarities is addressed. A mobile robot is placed at an unknown location inside a 2D self-similar polygonal environment P. The robot has a map of P and can compute visibility data through sensing. However, the self-similarities in the environment mean that the same visibility data may correspond to several diff...

METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...

On Em - like Algorithms for Minimum Distance Estimation

We study minimum distance estimation problems related to maximum likelihood estimation in positron emission tomography (pet), which admit algorithms similar to the standard em algorithm for pet with the same type of monotonicity properties as does the em algorithm, see Vardi, Shepp, and Kaufman [25]. We derive the algorithms via the majorizing function approach of De Pierro [11], as well as via...

Some algorithms for computing the minimum distance of evaluation codes

Our purpose is to present some computations and estimates for the minimum distance of some families of evaluation codes. We introduce the Feng-Rao distance of an algebraic-geometry code and its extension to codes from order domains. Finally we give an algorithm to compute the Feng-Rao distance of a code from an order domain and we show its implementation in the computer algebra system SINGULAR.

Fast randomized algorithms for omputing minimum f3,4,5,6g-way uts